Secret-sharing schemes and orthogonal systems of k-ary operations
نویسنده
چکیده
We suggest a general method of the construction of secret-sharing schemes based on orthogonal systems of partial (in particular, everywhere determined) k-ary operations which generalizes some known methods of the construction of such schemes by a nite elds and point the orthogonal systems of k-ary operations respecting to these known schemes. The di erent transformations of orthogonal systems of k-ary operations are reformulated and applied to orthogonal systems of polynomial k-ary operations over nite elds, in particular, to orthogonal systems corresponding to some known schemes.
منابع مشابه
Security Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملComputationally secure multiple secret sharing: models, schemes, and formal security analysis
A multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants. in such a way a multi-secret sharing scheme (MSS) allows a dealer to share multiple secrets among a set of participants, such that any authorized subset of participants can reconstruct the secrets. Up to now, existing MSSs either require too long shares for participants to be perfect secur...
متن کاملA NEW SECRET SHARING SCHEME ADVERSARY FUZZY STRUCTURE BASED ON AUTOMATA
In this paper,we introduce a new verifiable multi-use multi-secretsharing scheme based on automata and one-way hash function. The scheme has theadversary fuzzy structure and satisfy the following properties:1) The dealer can change the participants and the adversary fuzzy structure without refreshing any participants' real-shadow. 2) The scheme is based on the inversion of weakly invertible fin...
متن کاملSuccessively orthogonal systems of k - ary operations
Systems of k-ary operations, k > 2, generalizing orthogonal sets are considered. These systems have the following property: every k successive k-ary operations of the system are orthogonal. We call these systems successively orthogonal, establish some properties, give examples and methods of construction of these systems.
متن کاملEfficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud without Encryption
LDPC codes, LT codes, and digital fountain techniques have received significant attention from both academics and industry in the past few years. By employing the underlying ideas of efficient Belief Propagation (BP) decoding process in LDPC and LT codes, this paper introduces three classes of secret sharing schemes called BP-XOR secret sharing schemes, pseudo-BP-XOR secret sharing schemes, and...
متن کامل